#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int jc[N];
int jc_1[N];
const int MOD = 998244353;
int qpow(int x,int p){
    int res = 1;
    while(p){
        if(p & 1){
            res = 1ll*res*x%MOD;
        }
        x = 1ll*x*x%MOD;
        p>>=1;
    }
}
int C(int n,int m){
    return 1ll*jc[n]*jc_1[n - m]%MOD*jc_1[m]%MOD;
}
int main(){
    int n,k;
    cin>>n>>k;
    jc[0] = 1;
    for(int i = 1;i<=max(n,k);i++){
        jc[i] = 1ll*jc[i - 1]*i%MOD;
    }
    jc_1[0] = 1;
    jc_1[max(n,k)] = qpow(jc[max(n,k)]);
    for(int i = max(n,k) - 1;i >= 1;i--){
        jc_1[i] = 1ll*jc_1[i + 1]*(i + 1)%MOD;
    }
    
}
/*
*/